Programming Fisher's Exact Method of Comparing Two Percentages
نویسندگان
چکیده
منابع مشابه
An Exact Jitter Method using Dynamic Programming
We are given a neural spike train with spike times t1, . . . , tn and we want to discover something about the resolution over which these spike times were generated. A heuristic approach is to fix a statistic of the spike train, say f(t1, . . . , tn), and then Monte Carlo jitter each of the spike times by some small random amount, computing the statistic over and over again for each jitter. Pre...
متن کاملPath following in the exact penalty method of convex programming
Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, ...
متن کاملConditional versus Unconditional Exact Tests for Comparing Two Binomials
There are two fundamentally different exact tests for comparing the equality of two binomial probabilities – Fisher’s exact test (Fisher, 1925), and Barnard’s exact test (Barnard, 1945). Fisher’s exact test (Fisher, 1925) is the more popular of the two. In fact, Fisher was bitterly critical of Barnard’s proposal for esoteric reasons that we will not go into here. Notwithstanding Fisher’s reserv...
متن کاملStatistical Literacy: Difficulties in Describing and Comparing Rates and Percentages
A basic goal of statistical literacy is to construct readily understandable ratio-based comparisons that follow directly from data, take into account multiple factors and can support arguments about causation. College students have considerable difficulty constructing such comparisons using rates and percentages. This paper asserts that the main cause of student difficulties is the combination ...
متن کاملBilinear programming: An exact algorithm
The Bilinear Programming Problem is a structured quadratic programming problem whose objective function is, in general, neither convex nor concave. Making use of the formal linearity of a dual formulation of the problem, we give a necessary and sufficient condition for optimality, and an algorithm to find an optimal solution. The Bilinear Programming Problem, in its general form, is to determin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Technometrics
سال: 1960
ISSN: 0040-1706,1537-2723
DOI: 10.1080/00401706.1960.10489883